On Landau’s Eigenvalue Theorem and Information Cut-Sets
نویسندگان
چکیده
منابع مشابه
On Landau's eigenvalue theorem and information cut-sets
A variation of Landau’s eigenvalue theorem describing the phase transition of the eigenvalues of a time-frequency limiting, self adjoint operator is presented. The total number of degrees of freedom of square-integrable, multi-dimensional, bandlimited functions is defined in terms of Kolmogorov’s nwidth and computed in some limiting regimes where the original theorem cannot be directly applied....
متن کاملThe First Eigenvalue of the Laplacian, Isoperimetric Constants, and the Max Flow Min Cut Theorem
We show how ’test’ vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we show that a continuous version of the classical Max Flow Min Cut Theorem for networks implies that Cheeger’s constant may be obtained precisely from such vec...
متن کاملMax k-cut and the smallest eigenvalue
Let G be a graph of order n and size m, and let mck (G) be the maximum size of a k-cut of G. It is shown that mck (G) k 1 k m μmin (G) n 2 , where μmin (G) is the smallest eigenvalue of the adjacency matrix of G. An infinite class of graphs forcing equality in this bound is constructed.
متن کاملIgnorable Common Information, Null Sets and Basu’s First Theorem
This paper deals with the Intersection Property, or Basu’s First Theorem, which is valid under a condition of no common information, also known as measurable separability. After formalizing this notion, the paper reviews general properties and give operational characterizations in two topical cases: the finite one and the multivariate normal one. The paper concludes discussing the relevance of ...
متن کاملOn the Least Eigenvalue of Graphs with Cut Vertices
Let S be a certain set of graphs. A graph is called a minimizing graph in the set S if its least eigenvalue attains the minimum among all graphs in S . In this paper, we determine the unique minimizing graph in Gn, where Gn denotes the set of connected graphs of order n with cut vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2456874